Scheduling Problems with Two Competing Agents
نویسندگان
چکیده
منابع مشابه
Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs on a single machine and has its own scheduling objective to optimize. The objective is to assign...
متن کاملA Lagrangian approach to single-machine scheduling problems with two competing agents
In this paper we develop branch and bound algorithms for a number of hard, two-agent scheduling problems, i.e., problems in which each agent has an objective function which depends on the completion times of its jobs only. We address the minimization of total weighted completion time of the first agent jobs, subject to a bound on the cost function of the second agent, which may be: (i) total we...
متن کاملSubset Weight Maximization with Two Competing Agents
We consider a game of two agents competing to add items into a solution set. Each agent owns a set of weighted items and seeks to maximize the sum of their weights in the solution set. In each round each agent submits one item for inclusion in the solution. We study two natural rules to decide the winner of each round: Rule 1 picks among the two submitted items the item with larger weight, Rule...
متن کاملSingle-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for th...
متن کاملMinimum cost subset selection with two competing agents
We address an optimization problem in which two agents, each with a set of weighted items, compete in order to minimize the total weight of their solution sets. The latter are built according to a sequential game consisting in a fixed number of rounds. In every round each agent submits one item that may be included in its solution set. We study two natural rules to decide which item between the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2004
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1030.0092